The Hamilton-Jacobi Skeleton

نویسندگان

  • Kaleem Siddiqi
  • Sylvain Bouix
  • Allen Tannenbaum
  • Steven W. Zucker
چکیده

The eikonal equation and variants of it are of significant interest for problems in computer vision and image processing. It is the basis for continuous versions of mathematical morphology, stereo, shape-from-shading and for recent dynamic theories of shape. Its numerical simulation can be delicate, owing to the formation of singularities in the evolving front, and is typically based on level set methods. However, there are more classical approaches rooted in Hamiltonian physics, which have received little consideration in computer vision. In this paper we first introduce a new algorithm for simulating the eikonal equation, which offers a number of computational and conceptual advantages over the earlier methods when it comes to shock tracking. Next, we introduce a very efficient algorithm for shock detection, where the key idea is to measure the net outward flux of a vector field per unit volume, and to detect locations where a conservation of energy principle is violated. We illustrate the approach with several numerical examples including skeletons of complex 2D and 3D shapes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Skeletonization via Viscosity Solutions for Hamilton-jacobi Pde

Our purpose in this work is to give an original and very simple approach for computing the skeleton of a closed shape. This approach is based on the relationship between Stochastic differential equations and viscosity solutions of certain PDE. We illustrate the effectiveness of viscosity solution methods for Hamilton-Jacobi PDE by designing a new approach for calculating the skeleton of 2D and ...

متن کامل

Curvature Correction of the Hamilton-Jacobi Skeleton

The Hamilton-Jacobi approach has proved to be a powerful and elegant method for extracting the skeleton of a shape. The approach is based on the fact that the inward evolving boundary flux is conservative everywhere except at skeletal points. Nonetheless this method appears to overlook the fact that the linear density of the evolving boundary front is not constant where the front is curved. In ...

متن کامل

Correcting curvature-density effects in the Hamilton-Jacobi skeleton

The Hamilton-Jacobi approach has proven to be a powerful and elegant method for extracting the skeleton of two-dimensional (2-D) shapes. The approach is based on the observation that the normalized flux associated with the inward evolution of the object boundary at nonskeletal points tends to zero as the size of the integration area tends to zero, while the flux is negative at the locations of ...

متن کامل

Hamilton-Jacobi Skeleton on Cortical Surfaces

In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In our approach, a cortical surface is first partitioned into sulcal and gyral regions via the solution of a variational problem using graph cuts, which can guarantee global optimality. After that, we extend the method of Hamilton-J...

متن کامل

Curvature Dependent Skeletonization

The Hamilton-Jacobi approach has proved to be a powerful and elegant method for extracting the skeleton of a shape. The approach is based on the fact that the dynamics of the inward evolving boundary is conservative everywhere except at skeletal points. Nonetheless this method appears to overlook the fact that the linear density of the evolving boundary front is not constant where the front is ...

متن کامل

Matching hierarchical structures for shape recognition

In this thesis we aim to develop a framework for clustering trees and representing and learning a generative model of graph structures from a set of training samples. The approach is applied to the problem of the recognition and classification of shape abstracted in terms of its morphological skeleton. We make five contributions. The first is an algorithm to approximate tree edit-distance using...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999